Method for calculating compressed RSA moduli

ABSTRACT

A method for generating a compressed RSA modulus, allowing up to two thirds of the bits of a modulus N to be fixed. N has a predetermined portion N H , which comprises two parts N h  and N m . A candidate RSA modulus that shares the N h  part is generated, and the candidate is then modified using Euclidian-type computations until it shares both N h  and N m . Also provided is an apparatus for calculating compressed RSA moduli according to the method and a computer program product.

FIELD OF THE INVENTION

The present invention is generally directed to cryptography, and in particular to compressed RSA moduli.

BACKGROUND OF THE INVENTION

This section is intended to introduce the reader to various aspects of art, which may be related to various aspects of the present invention that are described and/or claimed below. This discussion is believed to be helpful in providing the reader with background information to facilitate a better understanding of the various aspects of the present invention. Accordingly, it should be understood that these statements are to be read in this light, and not as admissions of prior art.

To generate so-called Rivest-Shamir-Adleman (RSA) moduli for use in public cryptography one may proceed as follows.

Let N=pq be the product of two large primes. Let e and d denote a pair of public and private exponents, satisfying

ed≡1(mod λ(N)),

with gcd(e, λ(N))=1 and λ being Carmichael's function. As N=pq, we have λ(N)=1 cm(p−1, q−1). Given x<N, the public operation (e.g., message encryption or signature verification) consists in raising x to the e-th power modulo N, i.e., in computing y=x^(e) mod N. Then, given y, the corresponding private operation (e.g., decryption of a ciphertext or signature generation) consists in computing y^(d) mod N. From the definition of e and d, we obviously have that y^(d)≡x (mod N). The private operation can be carried out at higher speed through Chinese remaindering (CRT mode). Computations are independently performed modulo p and q and then recombined. In this case, private parameters are {p, q, d_(p), d_(q), i_(q)} with

d _(p) =d mod(p−1),

d _(q) =d mod(q−1), and

i _(q) =q ⁻¹ mod p.

We then obtain y^(d) mod N as

CRT(x _(p) , x _(q))=x _(q) +q[i _(q)(x _(p) −x _(q))mod p]

where x_(p)=y^(dp) mod p and x_(q)=y^(dq) mod q.

In summary, a RSA modulus N=pq is the product of two large prime numbers p and q, satisfying gcd(λ(N), e)=1. If n denotes the bit-size of N then, for some 1<n₀<n, p must lie in the range [2^(n−n) ₀ ^(−1/2), 2^(n−n) ₀−1] and q in the range [2^(n) ₀ ^(−1/2), 2^(n) ₀−1] so that 2^(n−1)<N=pq<2^(n). For security reasons, so-called balanced moduli, with n=2n₀, are generally preferred.

Typical present-day RSA moduli range in length from 1024 to 4096 bits, and it has become customary for applications to require moduli of at least 2048 bits. However, there are still programs and/or devices running the RSA-enabled applications that are designed to support only 1024-bit moduli.

It will be appreciated a solution that enables the compression moduli so that they can fit in shorter buffers or bandwidths would be greatly beneficial. Rather than storing/sending the whole RSA moduli, a lossless compressed representation is used. This also solves compatibility problems between different releases of programs and/or devices. In addition, such techniques can be used for improved efficiency: savings in memory and/or bandwidth.

One such solution is described by Vanstone and Zuccherato in “Short RSA Keys and Their Generation”, Journal of Cryptology, New York, N.Y., US, vol. 8, no. 8, 1995, pages 101-114, XP000853671. The solution enables specification of up to N/2 leading bits, but it is rather complicated, requiring e.g. factorization of the number given by the specified bits. In addition, the resulting moduli are relatively easy to factor.

Another such solution is described by Lenstra, Arjen K. in “Generating RSA moduli with a predetermined portion”; Advances in Cryptology—ASIACRYPT '98, volume 1514 of Lecture Notes in Computer Science, pp. 1-10; Springer 1998. This solution is an improvement upon the solution by Vanstone and Zuccherato as it is less complicated and as the resulting moduli are more difficult to factor.

However, neither of the prior art methods allow the predetermination of more than half of the bits of an RSA modulus.

The present invention, however, improves on Lenstra's generation method in that it for example allows greater compression.

SUMMARY OF THE INVENTION

In a first aspect, the invention is directed to a method for generating factors of a RSA modulus comprising a predetermined portion that can be larger than one half of the RSA modulus, the RSA modulus comprising at least two factors. First a value of a predetermined portion that the RSA modulus is to share is received. At least two candidate factors whose product shares at least a first part of the predetermined portion are generated. The at least two candidate factors are modified using Euclidean type computations until the resulting factors are prime and a product of the resulting factors fully shares the predetermined portion by using an extension of the Extended Euclidean Algorithm to evaluate a correcting value for each of the at least two factors; and adding respectively the correcting values to the at least two candidate factors to obtain at least two resulting factors; wherein the product of the resulting factors comprises the first shared part and shares the second part of the predetermined portion. Finally, the resulting factors are output in order to allow cryptographic operations using the resulting factors.

In a first preferred embodiment, the RSA modulus is a three-prime RSA modulus.

In a second preferred embodiment, the RSA modulus is of the form N=p^(r)q.

In a third preferred embodiment, the generating step comprises the steps of: choosing a first candidate factor; and calculating a second candidate factor as the integer result of a division of a value and the first candidate factor, so that the product of the candidate factors shares at least the first part of the predetermined portion, the value having as many bits as the RSA modulus and sharing the predetermined portion.

In a fourth preferred embodiment, the extension of the Extended Euclidean Algorithm uses a sequence {u_(i), v_(i), d_(i)} obtained by the Extended Euclidean Algorithm satisfying a u_(i)+b v_(i)=d_(i) with a=q₀ and b=p₀ to derive two companion sequences {x_(i)} and {y_(i)} given by

$\left\{ {{x_{0} = 0};{x_{i} = {x_{i - 1} + {\left\lfloor \frac{z_{i - 1}}{d_{i}} \right\rfloor u_{i}}}}} \right\}$ and $\left\{ {{y_{0} = 0};{y_{i} = {y_{i - 1} + {\left\lfloor \frac{z_{i - 1}}{d_{i}} \right\rfloor v_{i}}}}} \right\}$

wherein z₀=c and z_(i)=z_(i−1) mod d_(i) with c=2^(l−1)+(N_(H)2^(l) mod p₀).

In a second aspect, the invention is directed to an apparatus for calculating factors of a RSA modulus comprising a predetermined portion that can be larger than one half of the RSA modulus, the RSA modulus comprising at least two factors. The apparatus comprises a processor adapted to: receive a value of a predetermined portion that the RSA modulus is to share; generate at least two candidate factors whose product shares at least a first part of the predetermined portion; modify the at least two candidate factors using Euclidean type computations until the resulting factors are prime and a product of the resulting factors fully shares the predetermined portion by: using an extension of the Extended Euclidean Algorithm to evaluate a correcting value for each of the at least two factors; and adding respectively the correcting values to the at least two candidate factors to obtain at least two resulting factors; wherein the product of the resulting factors comprises the first shared part and shares the second part of the predetermined portion. The processor is further adapted to output the resulting factors in order to allow cryptographic operations using the resulting factors.

In a third aspect, the invention is directed to a computer program product comprising program code instructions for the execution of the steps of the method according to the first aspect when said program is executed in a processor.

“Sharing” is to be interpreted as having the same value for the part that is shared, e.g. hexadecimal 1234567890abcdef and 123456789abcdef0 share 123456789 in the leading part of the numbers.

BRIEF DESCRIPTION OF THE DRAWINGS

Preferred features of the present invention will now be described, by way of example, with reference to the accompanying drawings, in which:

FIG. 1 illustrates an exemplary RSA modulus 10 according to the present invention;

FIG. 2 illustrates en example of the method of the present invention applied the RSA-2048 challenge; and

FIG. 3 illustrates an apparatus; for calculating compressed RSA moduli.

DETAILED DESCRIPTION OF PREFERRED EMBODIMENTS

The main inventive concept of the present invention is a method of providing a n-bit RSA modulus N for use in generating a key in an RSA-type cryptographic scheme where up to about two thirds of the n bits of N are predetermined.

FIG. 1 illustrates an exemplary RSA modulus 10 according to the present invention. l denotes the bit-length of N_(l). Hence n=n₀+k′+l.

Let N=pq be the product of two large primes where p is (n−n₀)-bit integer and q is a n₀-bit integer so that N is an n-bit RSA modulus.

First, we compute p₀ and q₀ as follows.

1. Using a pseudo-random number generator, produce a (n₀+k′)-bit integer N_(H) from a random seed s₀:

N _(H) :=N _(h) ∥N _(m)=2^(n) ⁰ ^(+k′−1)

PRNG(s ₀)ε[2^(n) ⁰ ⁻¹,2^(n) ⁰ −1]∥[0,2^(k′)−1].

The skilled person will appreciate that it is naturally also possible to choose this value. 2. Randomly choose an integer p₀ε[┌2^(n−n) ⁰ ^(−1/2)┐2^(n−n) ⁰ 1].

3. Define

$q_{0} = {\left\lfloor \frac{N_{H}2^{1}}{p_{0\;}} \right\rfloor.}$

The skilled person will appreciate that this choice for p₀ and q₀ implies that N_(H)2^(l)−p₀q₀=N_(H)2^(l) mod p₀.

Next, we write p=p₀+x and q=q₀+y, and z=xy+2^(l−1)−N_(l). Hence, we obtain

N=N _(H)2^(l) +N _(l) =p ₀ q ₀+(p ₀ y+q ₀ x)+xy

q ₀ x+p ₀ y+xy−N _(l) =N _(H)2^(l) −p ₀ q ₀.

q ₀ x+p ₀ y+z=2^(l−1)+(N _(H)2^(l) mod p ₀)

We now have to find integer solutions (x, y, z) to the latter equation that fulfil |xy−z|=N_(l)−2^(l−1)|<2^(l−1). For this, we consider the sequence {u_(i), v_(i), d_(i)} obtained by the Extended Euclidean Algorithm satisfying

a u _(i) +b v _(i) =d _(i) with a=q₀ and b=p₀.

The Extended Euclidean Algorithm produces three sequences: {u_(i)}, {v_(i)}, and {d_(i)}. Below is an extension of the Extended Euclidean Algorithm that produces at least one different sequence implicitly or explicitly based on at least one of the sequences of the Extended Euclidean Algorithm.

Then we define z₀=c and z_(i)=z_(i−1) mod d_(i) with c=2^(l−1)+(N_(H)2^(l) mod p₀) and the two companion sequences {x_(i)} and {y_(i)} given by

$\left\{ {{x_{0} = 0};{x_{i} = {x_{i - 1} + {\left\lfloor \frac{z_{i - 1}}{d_{i}} \right\rfloor u_{i}}}}} \right\}$ and $\left\{ {{y_{0} = 0};{y_{i} = {y_{i - 1} + {\left\lfloor \frac{z_{i - 1}}{d_{i\;}} \right\rfloor v_{i}}}}} \right\}$

We have

$\begin{matrix} {{{ax}_{i} + {by}_{i}} = {{ax}_{i - 1} + {by}_{i - 1} + {\left\lfloor \frac{z_{i - 1}}{d_{i}} \right\rfloor \left( {{a\; u_{i\;}} + {bv}_{i}} \right)}}} \\ {= {{ax}_{i - 1} + {by}_{i - 1} + {\left\lfloor \frac{z_{i - 1}}{d_{i}} \right\rfloor d_{i}}}} \\ {= {{ax}_{i - 1} + {by}_{i - 1} + z_{i - 1} - \left( {z_{i - 1}\; {mod}\mspace{20mu} d_{i\;}} \right)}} \\ {= {{ax}_{i - 1} + {by}_{i - 1} + z_{i - 1} - z_{i}}} \\ {= {{ax}_{0} + {by}_{0} + z_{0} - z_{i}}} \\ {= {c - z_{i}}} \end{matrix}$

as requested, and there is a solution in the required range.

FIG. 2 illustrates en example of the method of the present invention applied the RSA-2048 challenge. As can be seen, the primes p and q generated by the method of the invention are such that the corresponding RSA modulus N=pq matches the RSA-2048 challenge on its upper two thirds (indicated by the underlined hexadecimal figures).

FIG. 3 illustrates an apparatus adapted to calculate RSA moduli. The apparatus 30 comprises a processor 31, which may be a single processor or a combination of several processors, a memory 32, a communication interface 33 that may be adapted to receive program code for executing the method from a storage medium 35 storing such program code, and a user interface 34.

The processor 31 is adapted to generate RSA moduli, preferably according to the preferred method of the invention, the memory 32 is adapted to store data, and the communication interface 33 is adapted to communicate with other devices.

The apparatus 30 is adapted to receive, via either the communication interface 33 or the user interface 34, a predetermined portion N_(H) as input for calculating one or more RSA modulus that share the predetermined portion N_(H). When the modulus has been calculated, the device outputs the modulus through the user interface or, preferably, to another device for use in RSA cryptography.

It will be appreciated that, while the method according to the preferred embodiment of the invention fixes the leading bits of the modulus, it is also possible to fix the trailing bits of modulus N. More generally, it is possible to fix some leading bits and some trailing bits of N, or a number of bits scattered throughout N.

The method of the invention can be adapted to accommodate RSA moduli that are made of more than 2 factors, for example, 3-prime RSA moduli or RSA moduli of the form N=p^(r)q.

The method according to the invention also applies when the common part of RSA modulus N, say N_(H), is shared among users or is common to all users for a given application. In such a case, there is no need to transmit it or the data needed to reconstruct the common part.

The skilled person will appreciate that RSA moduli generated using the present invention allow communicating parties in data communication system-to-exchange only about one third of the bits of N together with the data necessary to recover the said predetermined portion (a seed in the preferred embodiment).

Furthermore, the party generating the key in the said RSA-type cryptographic scheme may also only store about one third of the bits of N together with the data necessary to recover the said predetermined portion (a seed in the preferred embodiment).

Our new method considerably reduces the transmission and/or the storage requirements in the key generation for use in an RSA-type cryptographic scheme.

The skilled person will appreciate that the invention for example allows generation of compressed RSA moduli.

It will be understood that the present invention has been described purely by way of example. Each feature disclosed in the description and (where appropriate) the claims and drawings may be provided independently or in any appropriate combination. Features described as being implemented in hardware may also be implemented in software, and vice versa.

Reference numerals appearing in the claims are by way of illustration only and shall have no limiting effect on the scope of the claims. 

1. A method for generating factors of a RSA modulus comprising a predetermined portion that can be larger than one half of the RSA modulus, the RSA modulus comprising at least two factors, the method comprising the steps of: receiving a value of a predetermined portion that the RSA modulus is to share; generating at least two candidate factors whose product shares at least a first part of the predetermined portion; modifying the at least two candidate factors using Euclidean type computations until the resulting factors are prime and a product of the resulting factors fully shares the predetermined portion by: using an extension of the Extended Euclidean Algorithm to evaluate a correcting value for each of the at least two factors; and adding respectively the correcting values to the at least two candidate factors to obtain at least two resulting factors; wherein the product of the resulting factors comprises the first shared part and shares the second part of the predetermined portion; and outputting the resulting factors in order to allow cryptographic operations using the resulting factors.
 2. The method of claim 1, wherein the RSA modulus is a three-prime RSA modulus.
 3. The method of claim 1, wherein the RSA modulus is of the form N=p^(r)q.
 4. The method of claim 1, wherein the generating step comprises the steps of: choosing a first candidate factor; and calculating a second candidate factor as the integer result of a division of a value and the first candidate factor, so that the product of the candidate factors shares at least the first part of the predetermined portion, the value having as many bits as the RSA modulus and sharing the predetermined portion.
 5. The method of claim 1, wherein the extension of the Extended Euclidean Algorithm uses a sequence {u_(i), v_(i), d_(i)} obtained by the Extended Euclidean Algorithm satisfying a u_(i)+b v_(i)=d_(i) with a=q₀ and b=p₀ to derive two companion sequences {x_(i)} and {y_(i)} given by $\left\{ {{x_{0} = 0};{x_{i} = {x_{i - 1} + {\left\lfloor \frac{z_{i - 1}}{d_{i\;}} \right\rfloor u_{i}}}}} \right\}$ and $\left\{ {{y_{0} = 0};{y_{i} = {y_{i - 1} + {\left\lfloor \frac{z_{{i - 1}\;}}{d_{i}} \right\rfloor v_{i}}}}} \right\}$ wherein z₀=c and z_(i)=z_(i−1) mod d_(i) with c=2^(l−1)+(N_(H)2^(l) mod p₀).
 6. An apparatus for calculating factors of a RSA modulus comprising a predetermined portion that can be larger than one half of the RSA modulus, the RSA modulus comprising at least two factors, the apparatus comprising a processor adapted to: receive a value of a predetermined portion that the RSA modulus is to share; generate at least two candidate factors whose product shares at least a first part of the predetermined portion; modify the at least two candidate factors using Euclidean type computations until the resulting factors are prime and a product of the resulting factors fully shares the predetermined portion by: using an extension of the Extended Euclidean Algorithm to evaluate a correcting value for each of the at least two factors; and adding respectively the correcting values to the at least two candidate factors to obtain at least two resulting factors; wherein the product of the resulting factors comprises the first shared part and shares the second part of the predetermined portion; and output the resulting factors in order to allow cryptographic operations using the resulting factors.
 7. Computer program product comprising program code instructions for the execution of the steps of the method according to claim 1 when said program is executed in a processor. 